On partitions of Ellentuck-large sets
نویسندگان
چکیده
منابع مشابه
On Sets Represented by Partitions
We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts) partitions of an integer n.
متن کاملOn Conjugation Partitions of Sets of Trinucleotides
We prove that a trinucleotide circular code is self-complementary if and only if its two conjugated classes are complement of each other. Using only this proposition, we prove that if a circular code is self-complementary then either both its two conjugated classes are circular codes or none is a circular code.
متن کاملCoding Partitions of Regular Sets
A coding partition of a set of words partitions this set into classes such that whenever a sequence, of minimal length, has two distinct factorizations, the words of these factorizations belong to the same class. The canonical coding partition is the finest coding partition that partitions the set of words in at most one unambiguous class and other classes that localize the ambiguities in the f...
متن کاملeffect of sub-grid scales on large eddy simulation of particle deposition in a turbulent channel flow
چکیده ندارد.
15 صفحه اولLarge Deviations of Divergence Measures on Partitions
We discuss Chernoo-type large deviation results for the total variation , the I-divergence errors, and the 2-divergence errors on partitions. In contrast to the total variation and the I-divergence, the 2-divergence has an unconventional large deviation rate. Applications to Bahadur eeciencies of goodness-of-t tests based on these divergence measures for multivariate observations are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2014
ISSN: 0166-8641
DOI: 10.1016/j.topol.2014.03.008